Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
661	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models Binay K. Bhattacharya∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-24 09:52:12 Binary trees Analysis of algorithms Computational complexity theory Time complexity Dynamic programming Interval graph Tree decomposition Rope Interval tree Graph theory Theoretical computer science Mathematics
662	Distributed Computing FS 2013 Prof. R. Wattenhofer / Jara Uitto Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:46 Computational complexity theory Mathematics Context of computational complexity Horner scheme Algorithm Mathematical logic Theoretical computer science
663	CCCG 2010, Winnipeg MB, August 9–11, 2010 The traveling salesman problem for lines and rays in the plane Adrian Dumitrescu∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 Operations research NP-complete problems Computational complexity theory Travelling salesman problem Approximation algorithm Linear programming Algorithm Polygon Theoretical computer science Mathematics Applied mathematics
664	Gossiping in a Multi-Channel Radio Network An Oblivious Approach to Coping with Malicious Interference (Extended Abstract) Shlomi Dolev1 , Seth Gilbert2 , Rachid Guerraoui3 , and Calvin Newport4 1 Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2007-09-28 06:21:17 Analysis of algorithms NP-complete problems Adversary model Gossip protocol Clique Time complexity Algorithm Theoretical computer science Applied mathematics Computational complexity theory
665	The min-# problem, a hybrid error criterion for near-linear time performance Lilian Buzer∗† Abstract 2.1 Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:46 Network theory Shortest path problem NP-complete problems Connectivity Euclidean plane geometry Analysis of algorithms Path decomposition Minimum spanning tree Theoretical computer science Computational complexity theory Mathematics
666	Generation of Eﬃcient Algorithms for Maximum Marking Problems (和訳: 最大マーク付け問題の効率的解法の自動生成) Isao Sasano Add to Reading List Source URL: www.sic.shibaura-it.ac.jp Language: English - Date: 2014-02-04 09:21:05 Operations research Combinatorial optimization Mathematical optimization NP-complete problems Algorithm Mathematical logic Knapsack problem Optimization problem Genetic algorithm Applied mathematics Theoretical computer science Computational complexity theory
667	On the Correlation Intractability of Obfuscated Pseudorandom Functions Ran Canetti∗ Yilei Chen† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-22 00:12:34 Pseudorandomness Cryptography Computational complexity theory Algorithmic information theory Pseudorandom generator Pseudorandom function family Obfuscated code Advantage Obfuscation Mathematics Theoretical computer science Applied mathematics
668	ANNALS OF PURE AND APPLIED LOGIC Annals of Pure and Applied Logic276 Fixed-parameter tractability and completeness IV: Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:20:30 Complexity classes NP-complete problems Structural complexity theory Mathematical optimization Parameterized complexity Dominating set P versus NP problem NP-complete Combinatory logic Theoretical computer science Computational complexity theory Applied mathematics
669	CCCG 2011, Toronto ON, August 10–12, 2011 Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning David Kirkpatrick∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Network theory Shortest path problem Geodesic Travelling salesman problem Motion planning Trigonometric functions NP Curvature Theoretical computer science Mathematics Computational complexity theory
670	Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 Analysis of algorithms Computational complexity theory Distributed computing Leader election Time complexity Distributed data storage Consensus Chang and Roberts algorithm Theoretical computer science Distributed algorithms Applied mathematics

UPDATE